Correction: “The smallest graph whose group is cyclic”
نویسندگان
چکیده
منابع مشابه
Characterization and axiomatization of all semigroups whose square is group
In this paper we give a characterization for all semigroups whose square is a group. Moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and Grouplikes,introduced by the author. Also, we observe that this paper characterizes and axiomatizes a class of Homogroups (semigroups containing an ideal subgroup). Finally, several equivalent conditions ...
متن کاملThe Petersen graph is the smallest 3-cop-win graph
In the game of cops and robbers on a graph G = (V,E), k cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the robber’s turn, he moves similarly. The cops win if there is some time at which a cop is at the same vertex as the robber. Otherwise, the robber wins. The minimum number of cops required to catch the robber is called the cop num...
متن کاملThe smallest nonevasive graph property
A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature t...
متن کاملcharacterization and axiomatization of all semigroups whose square is group
in this paper we give a characterization for all semigroups whose square is a group. moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and grouplikes,introduced by the author. also, we observe that this paper characterizes and axiomatizes a class of homogroups (semigroups containing an ideal subgroup). finally, several equivalent conditions ...
متن کاملNon-cyclic Graph of a Group
We associate a graph ΓG to a non locally cyclic group G (called the non-cyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G | 〈x, y〉 is cyclic for all y ∈ G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the gro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1972
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1972.101085